Reordering and Partitioning of Distributed Quantum Circuits

A new approach to reduce the teleportation cost and execution time in Distributed Quantum Circuits (DQCs) was proposed present paper. DQCs, a well-known solution, have been applied solve problem of maintaining large number qubits next each other. In distributed quantum system, are transferred another subsystem by protocol like teleportation. Hence, novel method optimize for generating DQC. To this end, first, circuit reordered according placement improve computational time, then modeled as graph. Finally, we combined genetic algorithm (GA) modified tabu search (MTS) partition graph model order obtain aimed at reducing costs. significant reduction (TC) (ET) obtained benchmark circuits. particular, performed more accurate optimization than previous approaches, yielded best results several